Extended finite automata over groups
نویسندگان
چکیده
منابع مشابه
Extended finite automata over groups
Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abel...
متن کاملThe Accepting Power of Finite Automata over Groups
Some results from [2], [5], [6] are generalized for nite automata over arbitrary groups. The accepting power is smaller when abelian groups are considered, in comparison with the non-abelian groups. We prove that this is due to the commutativity. Each language accepted by a nite automaton over an abelian group is actually a unordered vector language. Finally, deterministic nite automata over gr...
متن کاملFinite-Memory Automata (Extended Abstract)
A model of computation dealing with infinite alphabets is proposed. This model is based on replacing the equality test by unijication. It appears to be a natural generalization of the classical Rabin-Scott finiteThe basic idea is to equip the automaton with a finite set of proper stam (like in the classic model), in which the “real computation” is done. In addition, the automaton is equipped wi...
متن کاملFinite Automata Presentable Abelian Groups
We give new examples of FA presentable torsion-free abelian groups. Namely, for every n > 2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (Z,+) in which every nontrivial cyclic subgroup is not FA recognizable.
متن کاملNon-Uniform Automata Over Groups
A new model, non-uniform deterministic finite automata (NUDFA’s) over general tinite monoids, has recently been developed as a strong link between the theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform NC’, NUDFA characterizations of several important subclasses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00200-6